Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract)
نویسندگان
چکیده
We study witness-isomorphic reductions, a type of structure-preserving reduction between NP-decision problems. We show that witness-isomorphic reductions can be used in a uniform approach to the local search problem
منابع مشابه
Query Complexity and Error Tolerance of Witness Finding Algorithms
We propose an abstract framework for studying search-to-decision reductions for NP. Specifically, we study the following witness finding problem: for a hidden nonempty set W ⊆ {0, 1}, the goal is to output a witness in W with constant probability by making randomized queries of the form “is Q ∩W nonempty?” where Q ⊆ {0, 1}. Algorithms for the witness finding problem can be seen as a general for...
متن کاملWitness Finding in the Black-Box Setting
We propose an abstract framework for studying search-to-decision reductions for NP. Specifically, we study the following witness finding problem: for a hidden nonempty set W ⊆ {0, 1}, the goal is to output a witness in W with constant probability by making randomized queries of the form “is Q ∩ W nonempty?” where Q ⊆ {0, 1}. Algorithms for the witness finding problem can be seen as a general fo...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملController Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملApplying Tabu Search with Innuential Diversiication to Multiprocessor Scheduling
We describe a tabu search approach to the scheduling problem of minimizing the makespan on n tasks on m equivalent processors. This problem is isomorphic to a variant of the multiple bin packing problem. We make use of a candidate list strategy that generates only a small subset of all possible moves, and employ a dynamic tabu list for handling tabu restrictions. We also introduce an innuential...
متن کامل